A Simple Linear Time LexBFS Cograph Recognition Algorithm
نویسندگان
چکیده
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for various families of graphs. In this paper, we add to this work by producing a simple two LexBFS sweep algorithm to recognize the family of cographs. This algorithm extends to other related graph families such as P4-reducible, P4-sparse, and distance hereditary. It is an open question whether our cograph recognition algorithm can be extended to a similarly easy algorithm for modular decomposition.
منابع مشابه
A New Graph Parameter to Measure Linearity
Since its introduction to recognize chordal graphs by Rose, Tarjan, and Lueker, Lexicographic Breadth First Search (LexBFS) has been used to come up with simple, often linear time, algorithms on various classes of graphs. These algorithms, called multi-sweep algorithms, compute a number of LexBFS orderings σ1, . . . , σk, where σi is used to break ties for σi+1, we write LexBFS (σi) = σi+1. For...
متن کاملA simple linear time algorithm for cograph recognition
In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P4-free graphs (where P4 denotes the path with 4 vertices). The recognition process works in two steps. First, we use partition refinement techniques to produce a factorizing permutation, i.e., an ordering of the vertices in which the strong modules appear consecutively. Then a very sim...
متن کاملLexBFS-Ordering in Asteroidal Triple-Free Graphs
In this paper, we study the metric property of LexBFS-ordering on AT-free graphs. Based on a 2-sweep LexBFS algorithm, we show that every AT-free graph admits a vertex ordering, called the strong 2-cocomparability ordering, that for any three vertices u v w in the ordering, if d(u; w) 2 then d(u; v) = 1 or d(v; w) 2. As an application of this ordering, we provide a simple linear time recognitio...
متن کاملCharacterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) where N is independent and G can be extended to a cograph by adding edges between certain non-probes. A partitioned probe cograph is a probe cograph with a given partition in N and P . We characterise probe cographs in se...
متن کاملA Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold graphs by a finite set of forbidden subgraphs: the class of weakly quasi-threshold graphs coincides with the class of {P4, co-(2P3)}-free graphs. Moreover we give the first linear-time algorithm to decide whether a given...
متن کامل